type internal/concurrent.entry

11 uses

	internal/concurrent (current package)
		hashtriemap.go#L125: 	var oldEntry *entry[K, V]
		hashtriemap.go#L149: func (ht *HashTrieMap[K, V]) expand(oldEntry, newEntry *entry[K, V], newHash uintptr, hashShift uint, parent *indirect[K, V]) *node[K, V] {
		hashtriemap.go#L341: type entry[K, V comparable] struct {
		hashtriemap.go#L343: 	overflow atomic.Pointer[entry[K, V]] // Overflow for hash collisions.
		hashtriemap.go#L348: func newEntryNode[K, V comparable](key K, value V) *entry[K, V] {
		hashtriemap.go#L349: 	return &entry[K, V]{
		hashtriemap.go#L356: func (e *entry[K, V]) lookup(key K, equal equalFunc) (V, bool) {
		hashtriemap.go#L370: func (head *entry[K, V]) compareAndDelete(key K, value V, keyEqual, valEqual equalFunc) (*entry[K, V], bool) {
		hashtriemap.go#L396: func (n *node[K, V]) entry() *entry[K, V] {
		hashtriemap.go#L400: 	return (*entry[K, V])(unsafe.Pointer(n))